./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl --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 56998212cbbe54111cbc2f72cf7e227ae5158c3547e0f2e9eaace18cc5cee700 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:24:48,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:24:48,902 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:24:48,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:24:48,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:24:48,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:24:48,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:24:48,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:24:48,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:24:48,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:24:48,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:24:48,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:24:48,939 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:24:48,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:24:48,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:24:48,940 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:24:48,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:24:48,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:24:48,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:24:48,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:24:48,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:24:48,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:24:48,944 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:24:48,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:24:48,944 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:24:48,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:24:48,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:24:48,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:24:48,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:48,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:24:48,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:24:48,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:24:48,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:24:48,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:24:48,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:24:48,948 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:24:48,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:24:48,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:24:48,949 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:24:48,949 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_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/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_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl 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 -> 56998212cbbe54111cbc2f72cf7e227ae5158c3547e0f2e9eaace18cc5cee700 [2023-11-12 02:24:49,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:24:49,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:24:49,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:24:49,242 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:24:49,242 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:24:49,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i [2023-11-12 02:24:52,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:24:52,720 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:24:52,721 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i [2023-11-12 02:24:52,731 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/data/5ed85cf10/d8345d5d495b4ea7b2b83a997093f58e/FLAG87a46fd8b [2023-11-12 02:24:52,747 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/data/5ed85cf10/d8345d5d495b4ea7b2b83a997093f58e [2023-11-12 02:24:52,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:24:52,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:24:52,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:52,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:24:52,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:24:52,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:52" (1/1) ... [2023-11-12 02:24:52,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9c5722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:52, skipping insertion in model container [2023-11-12 02:24:52,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:52" (1/1) ... [2023-11-12 02:24:52,798 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:24:52,960 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i[916,929] [2023-11-12 02:24:53,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:53,029 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:24:53,046 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i[916,929] [2023-11-12 02:24:53,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:24:53,093 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:24:53,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53 WrapperNode [2023-11-12 02:24:53,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:24:53,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:53,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:24:53,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:24:53,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,171 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-11-12 02:24:53,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:24:53,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:24:53,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:24:53,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:24:53,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:24:53,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:24:53,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:24:53,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:24:53,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (1/1) ... [2023-11-12 02:24:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:24:53,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:24:53,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:24:53,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:24:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:24:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:24:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:24:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:24:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:24:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:24:53,384 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:24:53,386 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:24:53,694 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:24:53,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:24:53,703 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:24:53,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:53 BoogieIcfgContainer [2023-11-12 02:24:53,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:24:53,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:24:53,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:24:53,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:24:53,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:24:52" (1/3) ... [2023-11-12 02:24:53,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5eddf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:53, skipping insertion in model container [2023-11-12 02:24:53,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:53" (2/3) ... [2023-11-12 02:24:53,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5eddf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:53, skipping insertion in model container [2023-11-12 02:24:53,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:53" (3/3) ... [2023-11-12 02:24:53,722 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-96.i [2023-11-12 02:24:53,741 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:24:53,741 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:24:53,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:24:53,798 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7e9acf8f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:24:53,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:24:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:24:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-12 02:24:53,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:53,824 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:53,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:53,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1589987544, now seen corresponding path program 1 times [2023-11-12 02:24:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478615621] [2023-11-12 02:24:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:24:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:24:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:24:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:24:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:24:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:24:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:24:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:24:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:24:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:24:54,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478615621] [2023-11-12 02:24:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478615621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:54,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:54,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:24:54,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226277942] [2023-11-12 02:24:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:54,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:24:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:24:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:24:54,454 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:24:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:54,490 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2023-11-12 02:24:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:24:54,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2023-11-12 02:24:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:54,506 INFO L225 Difference]: With dead ends: 101 [2023-11-12 02:24:54,507 INFO L226 Difference]: Without dead ends: 50 [2023-11-12 02:24:54,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:24:54,517 INFO L413 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:54,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-12 02:24:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-12 02:24:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:24:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2023-11-12 02:24:54,570 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2023-11-12 02:24:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:54,571 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2023-11-12 02:24:54,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:24:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2023-11-12 02:24:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-12 02:24:54,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:54,579 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:54,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:24:54,580 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:54,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1412679144, now seen corresponding path program 1 times [2023-11-12 02:24:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867453233] [2023-11-12 02:24:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:24:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:24:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:24:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:24:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:24:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:24:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:24:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:24:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:24:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:24:57,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867453233] [2023-11-12 02:24:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867453233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:24:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545497383] [2023-11-12 02:24:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:57,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:24:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:24:57,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:24:57,643 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:24:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:58,067 INFO L93 Difference]: Finished difference Result 166 states and 249 transitions. [2023-11-12 02:24:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:24:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2023-11-12 02:24:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:58,071 INFO L225 Difference]: With dead ends: 166 [2023-11-12 02:24:58,071 INFO L226 Difference]: Without dead ends: 119 [2023-11-12 02:24:58,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:24:58,074 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:58,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 555 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:24:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-12 02:24:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 59. [2023-11-12 02:24:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:24:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2023-11-12 02:24:58,098 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 113 [2023-11-12 02:24:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:58,099 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2023-11-12 02:24:58,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:24:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2023-11-12 02:24:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-12 02:24:58,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:58,113 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:58,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:24:58,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:58,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2092737514, now seen corresponding path program 1 times [2023-11-12 02:24:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:58,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771852291] [2023-11-12 02:24:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:24:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:24:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:24:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:24:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:24:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:24:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:24:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:24:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:24:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:24:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:24:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:24:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:24:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:24:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:24:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:58,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771852291] [2023-11-12 02:24:58,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771852291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:58,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:24:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517012627] [2023-11-12 02:24:58,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:58,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:24:58,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:58,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:24:58,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:24:58,403 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:24:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:58,541 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2023-11-12 02:24:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:24:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2023-11-12 02:24:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:58,545 INFO L225 Difference]: With dead ends: 174 [2023-11-12 02:24:58,545 INFO L226 Difference]: Without dead ends: 118 [2023-11-12 02:24:58,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:24:58,548 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 61 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:58,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 198 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:24:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-12 02:24:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2023-11-12 02:24:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 69 states have internal predecessors, (84), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:24:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-11-12 02:24:58,574 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 113 [2023-11-12 02:24:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:58,575 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-11-12 02:24:58,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:24:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-11-12 02:24:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-12 02:24:58,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:58,579 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:58,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:24:58,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:58,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 67697332, now seen corresponding path program 1 times [2023-11-12 02:24:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260034444] [2023-11-12 02:24:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:25:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:25:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:25:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:25:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:25:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:25:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:25:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:25:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:25:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:25:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:25:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:25:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:25:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:25:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:25:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260034444] [2023-11-12 02:25:00,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260034444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:00,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:00,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:25:00,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151430465] [2023-11-12 02:25:00,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:00,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:25:00,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:25:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:25:00,788 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:25:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:01,218 INFO L93 Difference]: Finished difference Result 305 states and 451 transitions. [2023-11-12 02:25:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:25:01,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2023-11-12 02:25:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:01,222 INFO L225 Difference]: With dead ends: 305 [2023-11-12 02:25:01,223 INFO L226 Difference]: Without dead ends: 200 [2023-11-12 02:25:01,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:25:01,226 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 61 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:01,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 415 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:25:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-12 02:25:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 102. [2023-11-12 02:25:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 63 states have internal predecessors, (75), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:25:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2023-11-12 02:25:01,255 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 114 [2023-11-12 02:25:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:01,256 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2023-11-12 02:25:01,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:25:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2023-11-12 02:25:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-11-12 02:25:01,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:01,263 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:01,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:25:01,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:01,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1892367389, now seen corresponding path program 1 times [2023-11-12 02:25:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487853544] [2023-11-12 02:25:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:25:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:25:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:25:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:25:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:25:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:25:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:25:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:25:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:25:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:25:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:25:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:25:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:25:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:25:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-12 02:25:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:25:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:25:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-12 02:25:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-12 02:25:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-12 02:25:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-12 02:25:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-12 02:25:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-12 02:25:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-12 02:25:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-12 02:25:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-12 02:25:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-12 02:25:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-12 02:25:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-12 02:25:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-12 02:25:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-12 02:25:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-12 02:25:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2023-11-12 02:25:03,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487853544] [2023-11-12 02:25:03,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487853544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:03,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:25:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839343695] [2023-11-12 02:25:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:03,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:25:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:25:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:03,909 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:25:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:04,344 INFO L93 Difference]: Finished difference Result 214 states and 315 transitions. [2023-11-12 02:25:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:25:04,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 225 [2023-11-12 02:25:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:04,349 INFO L225 Difference]: With dead ends: 214 [2023-11-12 02:25:04,349 INFO L226 Difference]: Without dead ends: 158 [2023-11-12 02:25:04,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:25:04,351 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 57 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:04,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 485 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:25:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-12 02:25:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2023-11-12 02:25:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:25:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 145 transitions. [2023-11-12 02:25:04,380 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 145 transitions. Word has length 225 [2023-11-12 02:25:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:04,381 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 145 transitions. [2023-11-12 02:25:04,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:25:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 145 transitions. [2023-11-12 02:25:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-11-12 02:25:04,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:04,385 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:04,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:25:04,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:04,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1917736375, now seen corresponding path program 1 times [2023-11-12 02:25:04,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:04,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522415543] [2023-11-12 02:25:04,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:04,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:25:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:25:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:25:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:25:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:25:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:25:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:25:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:25:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:25:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:25:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:25:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:25:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:25:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:25:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:25:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-12 02:25:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:25:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:25:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-12 02:25:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-12 02:25:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-12 02:25:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-12 02:25:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-12 02:25:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-12 02:25:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-12 02:25:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-12 02:25:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-12 02:25:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-12 02:25:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-12 02:25:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-12 02:25:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-12 02:25:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-12 02:25:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-12 02:25:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2023-11-12 02:25:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522415543] [2023-11-12 02:25:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522415543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:25:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729265317] [2023-11-12 02:25:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:07,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:25:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:25:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:25:07,671 INFO L87 Difference]: Start difference. First operand 101 states and 145 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:25:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:08,266 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2023-11-12 02:25:08,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:25:08,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 226 [2023-11-12 02:25:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:08,268 INFO L225 Difference]: With dead ends: 207 [2023-11-12 02:25:08,268 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:25:08,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:25:08,270 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 49 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:08,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 454 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:25:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:25:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:25:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:25:08,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2023-11-12 02:25:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:08,272 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:25:08,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:25:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:25:08,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:25:08,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:25:08,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:25:08,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:25:08,323 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-12 02:25:08,324 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-12 02:25:08,324 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 64) no Hoare annotation was computed. [2023-11-12 02:25:08,324 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-12 02:25:08,324 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:25:08,324 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-12 02:25:08,325 INFO L902 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: true [2023-11-12 02:25:08,325 INFO L902 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: true [2023-11-12 02:25:08,325 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 54) no Hoare annotation was computed. [2023-11-12 02:25:08,325 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-12 02:25:08,326 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-12 02:25:08,326 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 103 114) no Hoare annotation was computed. [2023-11-12 02:25:08,326 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 66) no Hoare annotation was computed. [2023-11-12 02:25:08,327 INFO L902 garLoopResultBuilder]: At program point L106-2(lines 106 112) the Hoare annotation is: true [2023-11-12 02:25:08,327 INFO L899 garLoopResultBuilder]: For program point L106-3(lines 106 112) no Hoare annotation was computed. [2023-11-12 02:25:08,327 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-12 02:25:08,327 INFO L902 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: true [2023-11-12 02:25:08,327 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:25:08,327 INFO L899 garLoopResultBuilder]: For program point L94(lines 67 95) no Hoare annotation was computed. [2023-11-12 02:25:08,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:25:08,328 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-12 02:25:08,328 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-12 02:25:08,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:25:08,330 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-12 02:25:08,331 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-11-12 02:25:08,331 INFO L902 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2023-11-12 02:25:08,331 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 99 102) no Hoare annotation was computed. [2023-11-12 02:25:08,331 INFO L902 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: true [2023-11-12 02:25:08,331 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-11-12 02:25:08,332 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 41 45) no Hoare annotation was computed. [2023-11-12 02:25:08,332 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-12 02:25:08,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:25:08,333 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-12 02:25:08,333 INFO L902 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: true [2023-11-12 02:25:08,333 INFO L902 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: true [2023-11-12 02:25:08,333 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-12 02:25:08,334 INFO L902 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: true [2023-11-12 02:25:08,334 INFO L902 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: true [2023-11-12 02:25:08,334 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:25:08,334 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2023-11-12 02:25:08,334 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2023-11-12 02:25:08,334 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 65) no Hoare annotation was computed. [2023-11-12 02:25:08,335 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-12 02:25:08,335 INFO L902 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: true [2023-11-12 02:25:08,335 INFO L902 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: true [2023-11-12 02:25:08,335 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 55) no Hoare annotation was computed. [2023-11-12 02:25:08,336 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 55) no Hoare annotation was computed. [2023-11-12 02:25:08,336 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-12 02:25:08,336 INFO L902 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: true [2023-11-12 02:25:08,336 INFO L902 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: true [2023-11-12 02:25:08,336 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-12 02:25:08,336 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-12 02:25:08,337 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-12 02:25:08,337 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-12 02:25:08,340 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-12 02:25:08,343 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:25:08,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:25:08 BoogieIcfgContainer [2023-11-12 02:25:08,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:25:08,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:25:08,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:25:08,357 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:25:08,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:53" (3/4) ... [2023-11-12 02:25:08,361 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:25:08,366 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 02:25:08,376 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-12 02:25:08,377 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:25:08,377 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:25:08,378 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:25:08,504 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:25:08,504 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:25:08,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:25:08,505 INFO L158 Benchmark]: Toolchain (without parser) took 15753.82ms. Allocated memory was 134.2MB in the beginning and 308.3MB in the end (delta: 174.1MB). Free memory was 95.1MB in the beginning and 244.2MB in the end (delta: -149.2MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2023-11-12 02:25:08,506 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 134.2MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:08,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.00ms. Allocated memory is still 134.2MB. Free memory was 95.1MB in the beginning and 82.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:25:08,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.33ms. Allocated memory is still 134.2MB. Free memory was 82.4MB in the beginning and 79.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:25:08,507 INFO L158 Benchmark]: Boogie Preprocessor took 38.99ms. Allocated memory is still 134.2MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:08,507 INFO L158 Benchmark]: RCFGBuilder took 494.03ms. Allocated memory is still 134.2MB. Free memory was 78.2MB in the beginning and 61.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 02:25:08,508 INFO L158 Benchmark]: TraceAbstraction took 14643.78ms. Allocated memory was 134.2MB in the beginning and 308.3MB in the end (delta: 174.1MB). Free memory was 61.1MB in the beginning and 249.5MB in the end (delta: -188.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:08,509 INFO L158 Benchmark]: Witness Printer took 148.07ms. Allocated memory is still 308.3MB. Free memory was 249.5MB in the beginning and 244.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:25:08,512 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.63ms. Allocated memory is still 134.2MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.00ms. Allocated memory is still 134.2MB. Free memory was 95.1MB in the beginning and 82.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.33ms. Allocated memory is still 134.2MB. Free memory was 82.4MB in the beginning and 79.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.99ms. Allocated memory is still 134.2MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 494.03ms. Allocated memory is still 134.2MB. Free memory was 78.2MB in the beginning and 61.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14643.78ms. Allocated memory was 134.2MB in the beginning and 308.3MB in the end (delta: 174.1MB). Free memory was 61.1MB in the beginning and 249.5MB in the end (delta: -188.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 148.07ms. Allocated memory is still 308.3MB. Free memory was 249.5MB in the beginning and 244.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 2180 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1525 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 655 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 225 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 199 PreInvPairs, 256 NumberOfFragments, 20 HoareAnnotationTreeSize, 199 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 898 ConstructedInterpolants, 0 QuantifiedInterpolants, 2198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 7563/7563 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-12 02:25:08,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5cc85aa-be38-4db6-b91e-417b39ddbfbd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE