./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX --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 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:29:13,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:13,795 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:29:13,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:13,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:13,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:13,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:13,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:13,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:13,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:13,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:13,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:13,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:13,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:13,842 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:13,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:13,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:13,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:29:13,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:29:13,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:29:13,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:13,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:13,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:13,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:13,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:13,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:29:13,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:13,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:13,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:13,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:13,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:13,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:13,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:13,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:13,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:13,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:13,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:29:13,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:29:13,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:13,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:13,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:13,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:13,857 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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX 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 -> 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 [2024-11-08 17:29:14,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:14,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:14,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:14,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:14,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:14,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i Unable to find full path for "g++" [2024-11-08 17:29:16,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:16,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:16,471 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-11-08 17:29:16,486 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data/f41449c06/017f15b3a67f4afa829e72c3906615e1/FLAGfcb4f855b [2024-11-08 17:29:16,503 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data/f41449c06/017f15b3a67f4afa829e72c3906615e1 [2024-11-08 17:29:16,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:16,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:16,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:16,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:16,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:16,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:16,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d17d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16, skipping insertion in model container [2024-11-08 17:29:16,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:16,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:16,784 WARN L250 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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-08 17:29:16,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:16,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:16,874 WARN L250 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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-08 17:29:16,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:16,932 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:16,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16 WrapperNode [2024-11-08 17:29:16,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:16,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:16,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:16,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:16,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:16,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,002 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-08 17:29:17,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:17,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:17,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:17,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:17,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,041 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-11-08 17:29:17,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:17,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:17,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:17,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:17,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (1/1) ... [2024-11-08 17:29:17,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:17,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:17,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:29:17,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:29:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:29:17,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:29:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:29:17,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:17,236 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:17,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:17,749 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:17,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:17,762 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:17,762 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:17,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:17 BoogieIcfgContainer [2024-11-08 17:29:17,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:17,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:17,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:17,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:17,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:16" (1/3) ... [2024-11-08 17:29:17,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ec1522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:17, skipping insertion in model container [2024-11-08 17:29:17,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:16" (2/3) ... [2024-11-08 17:29:17,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ec1522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:17, skipping insertion in model container [2024-11-08 17:29:17,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:17" (3/3) ... [2024-11-08 17:29:17,772 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-63.i [2024-11-08 17:29:17,791 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:17,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:17,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:17,883 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;@70438a90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:17,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:29:17,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:17,906 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:17,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:17,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash 686745244, now seen corresponding path program 1 times [2024-11-08 17:29:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:17,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122293607] [2024-11-08 17:29:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:18,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:18,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122293607] [2024-11-08 17:29:18,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122293607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:18,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:18,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:29:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769426690] [2024-11-08 17:29:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:18,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:29:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:18,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:29:18,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:18,435 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:29:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:18,467 INFO L93 Difference]: Finished difference Result 137 states and 222 transitions. [2024-11-08 17:29:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:29:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2024-11-08 17:29:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:18,478 INFO L225 Difference]: With dead ends: 137 [2024-11-08 17:29:18,478 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 17:29:18,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-11-08 17:29:18,488 INFO L432 NwaCegarLoop]: 99 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, 99 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-11-08 17:29:18,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 17:29:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 17:29:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-08 17:29:18,543 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 116 [2024-11-08 17:29:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:18,544 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-08 17:29:18,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:29:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-08 17:29:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:29:18,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:18,548 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:18,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:29:18,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1941471056, now seen corresponding path program 1 times [2024-11-08 17:29:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224962655] [2024-11-08 17:29:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:18,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224962655] [2024-11-08 17:29:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224962655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:18,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:18,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881470520] [2024-11-08 17:29:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:18,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:18,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:18,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:18,986 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:19,053 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2024-11-08 17:29:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 17:29:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:19,057 INFO L225 Difference]: With dead ends: 163 [2024-11-08 17:29:19,057 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 17:29:19,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-11-08 17:29:19,059 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 34 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:19,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 207 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 17:29:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2024-11-08 17:29:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-08 17:29:19,074 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 116 [2024-11-08 17:29:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:19,076 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-08 17:29:19,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-08 17:29:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:29:19,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:19,080 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:19,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:29:19,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:19,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1641021552, now seen corresponding path program 1 times [2024-11-08 17:29:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:19,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683046813] [2024-11-08 17:29:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683046813] [2024-11-08 17:29:19,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683046813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:19,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720348997] [2024-11-08 17:29:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:19,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:19,601 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:19,928 INFO L93 Difference]: Finished difference Result 288 states and 421 transitions. [2024-11-08 17:29:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:19,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 17:29:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:19,938 INFO L225 Difference]: With dead ends: 288 [2024-11-08 17:29:19,938 INFO L226 Difference]: Without dead ends: 210 [2024-11-08 17:29:19,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:19,940 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 170 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:19,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 365 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-08 17:29:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 104. [2024-11-08 17:29:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-11-08 17:29:19,975 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 116 [2024-11-08 17:29:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:19,975 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-11-08 17:29:19,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-11-08 17:29:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:29:19,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:19,981 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:19,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:29:19,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1899186990, now seen corresponding path program 1 times [2024-11-08 17:29:19,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:19,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469098028] [2024-11-08 17:29:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:20,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469098028] [2024-11-08 17:29:20,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469098028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:20,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:20,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000133194] [2024-11-08 17:29:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:20,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:20,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:20,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:20,564 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:20,915 INFO L93 Difference]: Finished difference Result 313 states and 451 transitions. [2024-11-08 17:29:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:20,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-08 17:29:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:20,918 INFO L225 Difference]: With dead ends: 313 [2024-11-08 17:29:20,918 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 17:29:20,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:20,924 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 170 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:20,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 462 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 17:29:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 106. [2024-11-08 17:29:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-11-08 17:29:20,938 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 116 [2024-11-08 17:29:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:20,939 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-11-08 17:29:20,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-11-08 17:29:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:29:20,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:20,942 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:20,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:29:20,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:20,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2091052603, now seen corresponding path program 1 times [2024-11-08 17:29:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:20,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868417819] [2024-11-08 17:29:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868417819] [2024-11-08 17:29:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868417819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:21,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868429235] [2024-11-08 17:29:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:21,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:21,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:21,505 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:22,127 INFO L93 Difference]: Finished difference Result 308 states and 442 transitions. [2024-11-08 17:29:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:22,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 17:29:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:22,131 INFO L225 Difference]: With dead ends: 308 [2024-11-08 17:29:22,131 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 17:29:22,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:22,134 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 186 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:22,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 529 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:29:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 17:29:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 123. [2024-11-08 17:29:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 105 states have internal predecessors, (142), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-11-08 17:29:22,163 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 117 [2024-11-08 17:29:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-11-08 17:29:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-11-08 17:29:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:29:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:22,165 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:22,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:29:22,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash 924051015, now seen corresponding path program 1 times [2024-11-08 17:29:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947685199] [2024-11-08 17:29:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:22,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947685199] [2024-11-08 17:29:22,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947685199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:22,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886269077] [2024-11-08 17:29:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:22,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:22,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:22,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:22,774 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:23,316 INFO L93 Difference]: Finished difference Result 360 states and 510 transitions. [2024-11-08 17:29:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:23,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 17:29:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:23,319 INFO L225 Difference]: With dead ends: 360 [2024-11-08 17:29:23,319 INFO L226 Difference]: Without dead ends: 240 [2024-11-08 17:29:23,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:23,321 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 216 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:23,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 453 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:29:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-08 17:29:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 104. [2024-11-08 17:29:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2024-11-08 17:29:23,334 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 117 [2024-11-08 17:29:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:23,335 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2024-11-08 17:29:23,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2024-11-08 17:29:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:29:23,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:23,337 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:23,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:29:23,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:23,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -971092990, now seen corresponding path program 1 times [2024-11-08 17:29:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648121433] [2024-11-08 17:29:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648121433] [2024-11-08 17:29:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648121433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421924622] [2024-11-08 17:29:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:23,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:23,992 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:24,829 INFO L93 Difference]: Finished difference Result 391 states and 560 transitions. [2024-11-08 17:29:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 17:29:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:24,833 INFO L225 Difference]: With dead ends: 391 [2024-11-08 17:29:24,835 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 17:29:24,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:24,838 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 278 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:24,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 360 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:29:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 17:29:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 127. [2024-11-08 17:29:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2024-11-08 17:29:24,891 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 117 [2024-11-08 17:29:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:24,892 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2024-11-08 17:29:24,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2024-11-08 17:29:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:29:24,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:24,895 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:24,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:29:24,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:24,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1229258428, now seen corresponding path program 1 times [2024-11-08 17:29:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:24,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359086524] [2024-11-08 17:29:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359086524] [2024-11-08 17:29:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359086524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:29:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492798646] [2024-11-08 17:29:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:25,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:29:25,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:29:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:25,499 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:25,954 INFO L93 Difference]: Finished difference Result 308 states and 436 transitions. [2024-11-08 17:29:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-08 17:29:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:25,957 INFO L225 Difference]: With dead ends: 308 [2024-11-08 17:29:25,957 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 17:29:25,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:25,959 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 71 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:25,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 849 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 17:29:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 135. [2024-11-08 17:29:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 190 transitions. [2024-11-08 17:29:26,011 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 190 transitions. Word has length 117 [2024-11-08 17:29:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:26,012 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 190 transitions. [2024-11-08 17:29:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2024-11-08 17:29:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:29:26,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:26,014 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:29:26,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1490681358, now seen corresponding path program 1 times [2024-11-08 17:29:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504204240] [2024-11-08 17:29:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:26,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504204240] [2024-11-08 17:29:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504204240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313968349] [2024-11-08 17:29:26,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:26,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:26,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:26,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:26,985 INFO L87 Difference]: Start difference. First operand 135 states and 190 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:27,271 INFO L93 Difference]: Finished difference Result 374 states and 524 transitions. [2024-11-08 17:29:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 17:29:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:27,274 INFO L225 Difference]: With dead ends: 374 [2024-11-08 17:29:27,274 INFO L226 Difference]: Without dead ends: 242 [2024-11-08 17:29:27,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:27,276 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 97 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:27,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 209 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-08 17:29:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2024-11-08 17:29:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 218 states have (on average 1.3623853211009174) internal successors, (297), 219 states have internal predecessors, (297), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2024-11-08 17:29:27,346 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 118 [2024-11-08 17:29:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:27,347 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2024-11-08 17:29:27,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2024-11-08 17:29:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:29:27,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:27,349 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:27,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:29:27,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:27,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1783217584, now seen corresponding path program 1 times [2024-11-08 17:29:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005492397] [2024-11-08 17:29:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:27,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:27,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005492397] [2024-11-08 17:29:27,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005492397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:27,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:27,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19241743] [2024-11-08 17:29:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:27,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:27,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:27,623 INFO L87 Difference]: Start difference. First operand 239 states and 333 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:28,058 INFO L93 Difference]: Finished difference Result 587 states and 814 transitions. [2024-11-08 17:29:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 17:29:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:28,062 INFO L225 Difference]: With dead ends: 587 [2024-11-08 17:29:28,062 INFO L226 Difference]: Without dead ends: 351 [2024-11-08 17:29:28,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:28,064 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:28,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 648 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-08 17:29:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 252. [2024-11-08 17:29:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 231 states have (on average 1.3376623376623376) internal successors, (309), 232 states have internal predecessors, (309), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 345 transitions. [2024-11-08 17:29:28,122 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 345 transitions. Word has length 118 [2024-11-08 17:29:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:28,123 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 345 transitions. [2024-11-08 17:29:28,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 345 transitions. [2024-11-08 17:29:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:29:28,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:28,125 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:28,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:29:28,126 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:28,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1496863635, now seen corresponding path program 1 times [2024-11-08 17:29:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221160455] [2024-11-08 17:29:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221160455] [2024-11-08 17:29:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221160455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:28,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:29:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592722945] [2024-11-08 17:29:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:28,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:29:28,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:28,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:29:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:28,845 INFO L87 Difference]: Start difference. First operand 252 states and 345 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:29,339 INFO L93 Difference]: Finished difference Result 641 states and 865 transitions. [2024-11-08 17:29:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:29:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 17:29:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:29,342 INFO L225 Difference]: With dead ends: 641 [2024-11-08 17:29:29,342 INFO L226 Difference]: Without dead ends: 392 [2024-11-08 17:29:29,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:29:29,343 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 98 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:29,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 585 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-08 17:29:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 258. [2024-11-08 17:29:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 237 states have (on average 1.2742616033755274) internal successors, (302), 238 states have internal predecessors, (302), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 338 transitions. [2024-11-08 17:29:29,397 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 338 transitions. Word has length 118 [2024-11-08 17:29:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:29,398 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 338 transitions. [2024-11-08 17:29:29,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 338 transitions. [2024-11-08 17:29:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:29:29,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:29,402 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:29:29,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:29,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash 118920185, now seen corresponding path program 1 times [2024-11-08 17:29:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:29,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173438720] [2024-11-08 17:29:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:29,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173438720] [2024-11-08 17:29:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173438720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797936420] [2024-11-08 17:29:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:29,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:29,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:29,549 INFO L87 Difference]: Start difference. First operand 258 states and 338 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:29,687 INFO L93 Difference]: Finished difference Result 593 states and 779 transitions. [2024-11-08 17:29:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 17:29:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:29,691 INFO L225 Difference]: With dead ends: 593 [2024-11-08 17:29:29,691 INFO L226 Difference]: Without dead ends: 338 [2024-11-08 17:29:29,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-11-08 17:29:29,693 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:29,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 178 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-08 17:29:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 262. [2024-11-08 17:29:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 241 states have (on average 1.2614107883817427) internal successors, (304), 242 states have internal predecessors, (304), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-11-08 17:29:29,763 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 118 [2024-11-08 17:29:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:29,763 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-11-08 17:29:29,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-11-08 17:29:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:29:29,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:29,766 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:29:29,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:29,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1271826640, now seen corresponding path program 1 times [2024-11-08 17:29:29,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:29,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737363758] [2024-11-08 17:29:29,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737363758] [2024-11-08 17:29:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737363758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:30,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:30,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:29:30,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833060534] [2024-11-08 17:29:30,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:30,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:29:30,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:29:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:30,367 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:31,348 INFO L93 Difference]: Finished difference Result 778 states and 1020 transitions. [2024-11-08 17:29:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:29:31,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-08 17:29:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:31,352 INFO L225 Difference]: With dead ends: 778 [2024-11-08 17:29:31,352 INFO L226 Difference]: Without dead ends: 519 [2024-11-08 17:29:31,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:29:31,353 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 179 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:31,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 757 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:29:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-08 17:29:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 418. [2024-11-08 17:29:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 380 states have (on average 1.2578947368421052) internal successors, (478), 381 states have internal predecessors, (478), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 546 transitions. [2024-11-08 17:29:31,449 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 546 transitions. Word has length 118 [2024-11-08 17:29:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:31,450 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 546 transitions. [2024-11-08 17:29:31,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 546 transitions. [2024-11-08 17:29:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:29:31,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:31,453 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:31,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:29:31,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:31,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash 449252547, now seen corresponding path program 1 times [2024-11-08 17:29:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:31,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460442564] [2024-11-08 17:29:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:31,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460442564] [2024-11-08 17:29:32,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460442564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:32,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:32,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:29:32,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491418938] [2024-11-08 17:29:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:32,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:29:32,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:32,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:29:32,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:32,088 INFO L87 Difference]: Start difference. First operand 418 states and 546 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:32,576 INFO L93 Difference]: Finished difference Result 1048 states and 1351 transitions. [2024-11-08 17:29:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:29:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 17:29:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:32,580 INFO L225 Difference]: With dead ends: 1048 [2024-11-08 17:29:32,580 INFO L226 Difference]: Without dead ends: 633 [2024-11-08 17:29:32,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:29:32,582 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 89 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:32,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 795 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-08 17:29:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 412. [2024-11-08 17:29:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 374 states have (on average 1.2540106951871657) internal successors, (469), 375 states have internal predecessors, (469), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 537 transitions. [2024-11-08 17:29:32,677 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 537 transitions. Word has length 119 [2024-11-08 17:29:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:32,677 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 537 transitions. [2024-11-08 17:29:32,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 537 transitions. [2024-11-08 17:29:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:29:32,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:32,680 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:32,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:29:32,680 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:32,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -70476621, now seen corresponding path program 1 times [2024-11-08 17:29:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460548981] [2024-11-08 17:29:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:32,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460548981] [2024-11-08 17:29:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460548981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:29:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440757722] [2024-11-08 17:29:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:29:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:29:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:33,369 INFO L87 Difference]: Start difference. First operand 412 states and 537 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:34,062 INFO L93 Difference]: Finished difference Result 999 states and 1290 transitions. [2024-11-08 17:29:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:29:34,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 17:29:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:34,065 INFO L225 Difference]: With dead ends: 999 [2024-11-08 17:29:34,066 INFO L226 Difference]: Without dead ends: 590 [2024-11-08 17:29:34,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:29:34,069 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 182 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:34,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 759 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:29:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-08 17:29:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 424. [2024-11-08 17:29:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 386 states have (on average 1.2461139896373057) internal successors, (481), 387 states have internal predecessors, (481), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 549 transitions. [2024-11-08 17:29:34,157 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 549 transitions. Word has length 119 [2024-11-08 17:29:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:34,158 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 549 transitions. [2024-11-08 17:29:34,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 549 transitions. [2024-11-08 17:29:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:29:34,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:34,161 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:34,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:29:34,161 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -749797569, now seen corresponding path program 1 times [2024-11-08 17:29:34,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:34,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044575430] [2024-11-08 17:29:34,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:34,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044575430] [2024-11-08 17:29:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044575430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791523187] [2024-11-08 17:29:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:34,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:34,314 INFO L87 Difference]: Start difference. First operand 424 states and 549 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:34,506 INFO L93 Difference]: Finished difference Result 956 states and 1244 transitions. [2024-11-08 17:29:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:34,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 17:29:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:34,509 INFO L225 Difference]: With dead ends: 956 [2024-11-08 17:29:34,510 INFO L226 Difference]: Without dead ends: 535 [2024-11-08 17:29:34,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-11-08 17:29:34,511 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 83 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:34,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 174 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-08 17:29:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 424. [2024-11-08 17:29:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 386 states have (on average 1.238341968911917) internal successors, (478), 387 states have internal predecessors, (478), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 546 transitions. [2024-11-08 17:29:34,603 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 546 transitions. Word has length 119 [2024-11-08 17:29:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:34,604 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 546 transitions. [2024-11-08 17:29:34,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 546 transitions. [2024-11-08 17:29:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:29:34,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:34,606 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:34,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:29:34,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:34,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2127113610, now seen corresponding path program 1 times [2024-11-08 17:29:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106016561] [2024-11-08 17:29:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:34,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106016561] [2024-11-08 17:29:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106016561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:34,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157423336] [2024-11-08 17:29:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:34,743 INFO L87 Difference]: Start difference. First operand 424 states and 546 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:34,969 INFO L93 Difference]: Finished difference Result 943 states and 1222 transitions. [2024-11-08 17:29:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:34,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 17:29:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:34,972 INFO L225 Difference]: With dead ends: 943 [2024-11-08 17:29:34,973 INFO L226 Difference]: Without dead ends: 522 [2024-11-08 17:29:34,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-11-08 17:29:34,975 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:34,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-08 17:29:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 412. [2024-11-08 17:29:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 374 states have (on average 1.2299465240641712) internal successors, (460), 375 states have internal predecessors, (460), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 528 transitions. [2024-11-08 17:29:35,072 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 528 transitions. Word has length 119 [2024-11-08 17:29:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:35,073 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 528 transitions. [2024-11-08 17:29:35,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 528 transitions. [2024-11-08 17:29:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:29:35,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:35,076 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:35,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:29:35,076 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:35,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1934427676, now seen corresponding path program 1 times [2024-11-08 17:29:35,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:35,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528789899] [2024-11-08 17:29:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528789899] [2024-11-08 17:29:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528789899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:35,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351282697] [2024-11-08 17:29:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:35,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:35,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:35,306 INFO L87 Difference]: Start difference. First operand 412 states and 528 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:35,630 INFO L93 Difference]: Finished difference Result 978 states and 1266 transitions. [2024-11-08 17:29:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:35,631 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 17:29:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:35,634 INFO L225 Difference]: With dead ends: 978 [2024-11-08 17:29:35,635 INFO L226 Difference]: Without dead ends: 569 [2024-11-08 17:29:35,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:35,636 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 169 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:35,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 249 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-08 17:29:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 376. [2024-11-08 17:29:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 338 states have (on average 1.2071005917159763) internal successors, (408), 339 states have internal predecessors, (408), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 476 transitions. [2024-11-08 17:29:35,721 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 476 transitions. Word has length 119 [2024-11-08 17:29:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:35,721 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 476 transitions. [2024-11-08 17:29:35,721 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 476 transitions. [2024-11-08 17:29:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:29:35,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:35,723 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:35,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:29:35,723 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:35,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash -287567053, now seen corresponding path program 1 times [2024-11-08 17:29:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292844933] [2024-11-08 17:29:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:36,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292844933] [2024-11-08 17:29:36,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292844933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:36,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:36,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:36,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181855774] [2024-11-08 17:29:36,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:36,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:36,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:36,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:36,108 INFO L87 Difference]: Start difference. First operand 376 states and 476 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:36,658 INFO L93 Difference]: Finished difference Result 777 states and 991 transitions. [2024-11-08 17:29:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:36,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-08 17:29:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:36,661 INFO L225 Difference]: With dead ends: 777 [2024-11-08 17:29:36,661 INFO L226 Difference]: Without dead ends: 391 [2024-11-08 17:29:36,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:36,663 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 175 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:36,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 390 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:29:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-08 17:29:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 349. [2024-11-08 17:29:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 311 states have (on average 1.202572347266881) internal successors, (374), 312 states have internal predecessors, (374), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 442 transitions. [2024-11-08 17:29:36,742 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 442 transitions. Word has length 119 [2024-11-08 17:29:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:36,743 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 442 transitions. [2024-11-08 17:29:36,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 442 transitions. [2024-11-08 17:29:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 17:29:36,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:36,746 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:36,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:29:36,746 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash -868230857, now seen corresponding path program 1 times [2024-11-08 17:29:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16853963] [2024-11-08 17:29:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16853963] [2024-11-08 17:29:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16853963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:37,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:29:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757104891] [2024-11-08 17:29:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:37,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:29:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:29:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:37,328 INFO L87 Difference]: Start difference. First operand 349 states and 442 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:38,097 INFO L93 Difference]: Finished difference Result 719 states and 896 transitions. [2024-11-08 17:29:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:29:38,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-08 17:29:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:38,100 INFO L225 Difference]: With dead ends: 719 [2024-11-08 17:29:38,100 INFO L226 Difference]: Without dead ends: 483 [2024-11-08 17:29:38,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:29:38,102 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:38,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 814 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:29:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-08 17:29:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 345. [2024-11-08 17:29:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 307 states have (on average 1.201954397394137) internal successors, (369), 308 states have internal predecessors, (369), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 17:29:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 437 transitions. [2024-11-08 17:29:38,190 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 437 transitions. Word has length 120 [2024-11-08 17:29:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:38,190 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 437 transitions. [2024-11-08 17:29:38,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 437 transitions. [2024-11-08 17:29:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 17:29:38,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:38,192 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:38,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:29:38,193 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash -54895558, now seen corresponding path program 1 times [2024-11-08 17:29:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:38,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389904140] [2024-11-08 17:29:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:29:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:29:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:29:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:29:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:29:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:29:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:29:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 17:29:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:38,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:38,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389904140] [2024-11-08 17:29:38,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389904140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:38,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:38,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336638318] [2024-11-08 17:29:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:38,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:38,615 INFO L87 Difference]: Start difference. First operand 345 states and 437 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:38,861 INFO L93 Difference]: Finished difference Result 690 states and 873 transitions. [2024-11-08 17:29:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:38,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-08 17:29:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:38,865 INFO L225 Difference]: With dead ends: 690 [2024-11-08 17:29:38,865 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 17:29:38,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:38,866 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 93 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:38,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 267 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 17:29:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 379. [2024-11-08 17:29:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 324 states have (on average 1.191358024691358) internal successors, (386), 325 states have internal predecessors, (386), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 17:29:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 486 transitions. [2024-11-08 17:29:38,984 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 486 transitions. Word has length 120 [2024-11-08 17:29:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:38,985 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 486 transitions. [2024-11-08 17:29:38,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:29:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 486 transitions. [2024-11-08 17:29:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 17:29:38,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:38,987 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:38,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:29:38,987 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:38,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1291823659, now seen corresponding path program 1 times [2024-11-08 17:29:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:38,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477049325] [2024-11-08 17:29:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:39,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:29:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:39,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:29:39,162 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:29:39,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:29:39,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:29:39,169 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:39,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:29:39,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:29:39 BoogieIcfgContainer [2024-11-08 17:29:39,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:29:39,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:29:39,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:29:39,290 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:29:39,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:17" (3/4) ... [2024-11-08 17:29:39,294 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:29:39,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:29:39,295 INFO L158 Benchmark]: Toolchain (without parser) took 22787.48ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 109.9MB in the beginning and 161.5MB in the end (delta: -51.6MB). Peak memory consumption was 241.9MB. Max. memory is 16.1GB. [2024-11-08 17:29:39,296 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:29:39,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.89ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 93.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:29:39,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.05ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:29:39,297 INFO L158 Benchmark]: Boogie Preprocessor took 58.72ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 84.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:29:39,297 INFO L158 Benchmark]: RCFGBuilder took 700.43ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 111.1MB in the end (delta: -26.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-08 17:29:39,301 INFO L158 Benchmark]: TraceAbstraction took 21524.41ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 109.9MB in the beginning and 162.5MB in the end (delta: -52.7MB). Peak memory consumption was 238.5MB. Max. memory is 16.1GB. [2024-11-08 17:29:39,301 INFO L158 Benchmark]: Witness Printer took 5.11ms. Allocated memory is still 434.1MB. Free memory was 162.5MB in the beginning and 161.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:29:39,302 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.89ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 93.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.05ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.72ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 84.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 700.43ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 111.1MB in the end (delta: -26.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21524.41ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 109.9MB in the beginning and 162.5MB in the end (delta: -52.7MB). Peak memory consumption was 238.5MB. Max. memory is 16.1GB. * Witness Printer took 5.11ms. Allocated memory is still 434.1MB. Free memory was 162.5MB in the beginning and 161.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] var_1_7 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L90] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L90] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L91] var_1_15 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_18 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] var_1_19 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] var_1_20 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] var_1_21 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] var_1_22 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] var_1_23 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] var_1_27 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_28 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L48] COND FALSE !(last_1_var_1_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L51] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L52] COND FALSE !(\read(var_1_7)) [L55] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L57] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L60] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L61] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L61] COND TRUE (var_1_32 >> var_1_32) < var_1_13 [L62] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L64] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L65] COND TRUE var_1_11 >= var_1_30 [L66] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L68] COND TRUE ! var_1_7 [L69] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L77] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L77] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L78] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121-L122] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2738 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2738 mSDsluCounter, 9386 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6345 mSDsCounter, 577 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3678 IncrementalHoareTripleChecker+Invalid, 4255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 577 mSolverCounterUnsat, 3041 mSDtfsCounter, 3678 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 873 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=424occurred in iteration=15, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 2132 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2455 ConstructedInterpolants, 0 QuantifiedInterpolants, 5913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 10080/10080 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 17:29:39,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX --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 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:29:41,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:41,896 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:29:41,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:41,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:41,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:41,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:41,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:41,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:41,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:41,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:41,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:41,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:41,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:41,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:41,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:41,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:41,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:29:41,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:29:41,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:41,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:41,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:41,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:41,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:29:41,962 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:29:41,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:41,962 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:29:41,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:29:41,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:41,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:41,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:41,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:41,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:41,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:41,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:41,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:41,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:41,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:41,969 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:29:41,970 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:29:41,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:41,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:41,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:41,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:41,981 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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX 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 -> 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 [2024-11-08 17:29:42,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:42,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:42,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:42,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:42,423 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:42,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i Unable to find full path for "g++" [2024-11-08 17:29:44,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:44,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:44,769 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-11-08 17:29:44,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data/f1c50d491/99c427f84edc4b4193f2df0f4552e828/FLAGfa2e40d52 [2024-11-08 17:29:44,797 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/data/f1c50d491/99c427f84edc4b4193f2df0f4552e828 [2024-11-08 17:29:44,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:44,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:44,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:44,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:44,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:44,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df7f7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44, skipping insertion in model container [2024-11-08 17:29:44,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:45,085 WARN L250 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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-08 17:29:45,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:45,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:45,227 WARN L250 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_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-08 17:29:45,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:45,360 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:45,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45 WrapperNode [2024-11-08 17:29:45,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:45,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:45,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:45,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:45,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,428 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-08 17:29:45,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:45,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:45,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:45,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:45,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,470 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-11-08 17:29:45,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:45,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:45,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:45,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:45,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (1/1) ... [2024-11-08 17:29:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:45,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:45,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:29:45,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:29:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:29:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:29:45,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:29:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:45,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:45,717 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:45,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:52,184 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:52,185 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:52,212 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:52,213 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:52,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:52 BoogieIcfgContainer [2024-11-08 17:29:52,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:52,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:52,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:52,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:52,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:44" (1/3) ... [2024-11-08 17:29:52,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5078ed2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:52, skipping insertion in model container [2024-11-08 17:29:52,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:45" (2/3) ... [2024-11-08 17:29:52,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5078ed2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:52, skipping insertion in model container [2024-11-08 17:29:52,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:52" (3/3) ... [2024-11-08 17:29:52,227 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-63.i [2024-11-08 17:29:52,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:52,254 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:52,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:52,387 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;@6173e2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:52,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:29:52,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:52,413 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:52,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:52,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash -597357280, now seen corresponding path program 1 times [2024-11-08 17:29:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:52,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346135967] [2024-11-08 17:29:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:52,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:52,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:52,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 17:29:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:53,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:29:53,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-08 17:29:53,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:53,134 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:53,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346135967] [2024-11-08 17:29:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346135967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:53,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:53,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:29:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847071454] [2024-11-08 17:29:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:53,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:29:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:29:53,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:53,167 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:29:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:53,193 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions. [2024-11-08 17:29:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:29:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2024-11-08 17:29:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:53,203 INFO L225 Difference]: With dead ends: 109 [2024-11-08 17:29:53,203 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 17:29:53,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-11-08 17:29:53,211 INFO L432 NwaCegarLoop]: 78 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, 78 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-11-08 17:29:53,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 17:29:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 17:29:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:29:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-08 17:29:53,276 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 110 [2024-11-08 17:29:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-08 17:29:53,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:29:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-08 17:29:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:29:53,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:53,284 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:29:53,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:29:53,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:53,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:53,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 28064980, now seen corresponding path program 1 times [2024-11-08 17:29:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690682738] [2024-11-08 17:29:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:53,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:53,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:53,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:53,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 17:29:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:53,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:29:53,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:29:55,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:55,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690682738] [2024-11-08 17:29:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690682738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:55,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667218716] [2024-11-08 17:29:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:55,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:55,764 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:30:00,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:04,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:06,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:06,668 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2024-11-08 17:30:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:06,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-08 17:30:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:06,692 INFO L225 Difference]: With dead ends: 157 [2024-11-08 17:30:06,692 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 17:30:06,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:06,694 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:06,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 208 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2024-11-08 17:30:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 17:30:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-11-08 17:30:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:30:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-11-08 17:30:06,729 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 110 [2024-11-08 17:30:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:06,730 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-11-08 17:30:06,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:30:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-11-08 17:30:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:30:06,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:06,732 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:30:06,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 17:30:06,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:06,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:06,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash -983052270, now seen corresponding path program 1 times [2024-11-08 17:30:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009736208] [2024-11-08 17:30:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:06,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:06,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:06,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 17:30:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:30:07,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:30:07,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:30:07,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009736208] [2024-11-08 17:30:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009736208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:07,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830951956] [2024-11-08 17:30:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:07,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:07,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:07,465 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:30:11,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:15,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:16,026 INFO L93 Difference]: Finished difference Result 165 states and 237 transitions. [2024-11-08 17:30:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:16,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-08 17:30:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:16,031 INFO L225 Difference]: With dead ends: 165 [2024-11-08 17:30:16,031 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 17:30:16,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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-11-08 17:30:16,034 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:16,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 148 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2024-11-08 17:30:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 17:30:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-11-08 17:30:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 69 states have internal predecessors, (84), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:30:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2024-11-08 17:30:16,075 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 110 [2024-11-08 17:30:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:16,079 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2024-11-08 17:30:16,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:30:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2024-11-08 17:30:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:30:16,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:16,086 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:30:16,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 17:30:16,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:16,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -23822254, now seen corresponding path program 1 times [2024-11-08 17:30:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015099641] [2024-11-08 17:30:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:16,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:16,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:16,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:16,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cefa6d-a250-4ae7-80b6-9dd2c22fcc5a/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 17:30:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:16,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:30:16,819 INFO L278 TraceCheckSpWp]: Computing forward predicates...