./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.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_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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_d1cd8ef0-062f-49db-922b-5e39b5e220af/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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:12:54,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:12:54,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:12:54,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:12:54,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:12:54,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:12:54,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:12:54,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:12:54,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:12:54,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:12:54,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:12:54,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:12:54,204 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:12:54,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:12:54,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:12:54,207 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:12:54,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:12:54,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:12:54,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:12:54,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:12:54,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:12:54,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:12:54,211 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:12:54,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:12:54,212 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:12:54,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:12:54,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:12:54,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:12:54,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:54,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:12:54,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:12:54,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:12:54,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:12:54,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:12:54,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:12:54,218 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:12:54,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:12:54,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:12:54,218 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:12:54,219 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_d1cd8ef0-062f-49db-922b-5e39b5e220af/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_d1cd8ef0-062f-49db-922b-5e39b5e220af/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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2023-11-12 02:12:54,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:12:54,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:12:54,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:12:54,528 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:12:54,529 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:12:54,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-12 02:12:57,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:12:57,837 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:12:57,838 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-12 02:12:57,848 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data/26d475590/f8547730d2f84716b3d390b1e598367c/FLAG43f403bf5 [2023-11-12 02:12:57,862 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data/26d475590/f8547730d2f84716b3d390b1e598367c [2023-11-12 02:12:57,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:12:57,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:12:57,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:57,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:12:57,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:12:57,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:57" (1/1) ... [2023-11-12 02:12:57,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0cc6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:57, skipping insertion in model container [2023-11-12 02:12:57,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:57" (1/1) ... [2023-11-12 02:12:57,924 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:12:58,083 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_d1cd8ef0-062f-49db-922b-5e39b5e220af/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-12 02:12:58,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:58,159 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:12:58,176 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_d1cd8ef0-062f-49db-922b-5e39b5e220af/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-12 02:12:58,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:58,229 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:12:58,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58 WrapperNode [2023-11-12 02:12:58,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:58,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:58,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:12:58,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:12:58,240 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:12:58" (1/1) ... [2023-11-12 02:12:58,254 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:12:58" (1/1) ... [2023-11-12 02:12:58,295 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2023-11-12 02:12:58,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:58,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:12:58,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:12:58,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:12:58,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:12:58,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:12:58,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:12:58,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:12:58,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (1/1) ... [2023-11-12 02:12:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:12:58,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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:12:58,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:12:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:12:58,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:12:58,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:12:58,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:12:58,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:12:58,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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:12:58,523 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:12:58,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:12:58,920 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:12:58,936 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:12:58,936 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:12:58,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:58 BoogieIcfgContainer [2023-11-12 02:12:58,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:12:58,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:12:58,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:12:58,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:12:58,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:12:57" (1/3) ... [2023-11-12 02:12:58,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6927d4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:58, skipping insertion in model container [2023-11-12 02:12:58,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:58" (2/3) ... [2023-11-12 02:12:58,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6927d4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:58, skipping insertion in model container [2023-11-12 02:12:58,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:58" (3/3) ... [2023-11-12 02:12:58,955 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-12 02:12:58,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:12:58,977 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:12:59,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:12:59,044 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;@5a66d74d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:12:59,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:12:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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:12:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-12 02:12:59,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:59,067 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:12:59,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:59,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash 912981449, now seen corresponding path program 1 times [2023-11-12 02:12:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26371225] [2023-11-12 02:12:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:59,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:12:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:12:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:12:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:12:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:12:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:12:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:12:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:12:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:12:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:12:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:12:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:12:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:12:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:12:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:12:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:12:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:12:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:59,601 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:12:59,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:59,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26371225] [2023-11-12 02:12:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26371225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:59,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:59,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:12:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118668343] [2023-11-12 02:12:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:59,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:12:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:12:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:12:59,650 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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.5) internal successors, (27), 2 states have internal predecessors, (27), 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:12:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:59,684 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2023-11-12 02:12:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:12:59,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 114 [2023-11-12 02:12:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:59,697 INFO L225 Difference]: With dead ends: 105 [2023-11-12 02:12:59,697 INFO L226 Difference]: Without dead ends: 52 [2023-11-12 02:12:59,701 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:12:59,705 INFO L413 NwaCegarLoop]: 76 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, 76 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:12:59,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-12 02:12:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-12 02:12:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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:12:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2023-11-12 02:12:59,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 114 [2023-11-12 02:12:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:59,775 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2023-11-12 02:12:59,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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:12:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2023-11-12 02:12:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-12 02:12:59,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:59,780 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:12:59,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:12:59,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:59,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1975372663, now seen corresponding path program 1 times [2023-11-12 02:12:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:59,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201770742] [2023-11-12 02:12:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:13:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:13:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:13:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:13:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:13:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:13:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:13:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:13:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:13:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:13:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:13:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:13:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:13:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:13:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:13:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:13:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,404 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:13:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201770742] [2023-11-12 02:13:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201770742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:00,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:00,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:13:00,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458192882] [2023-11-12 02:13:00,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:00,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:13:00,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:00,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:13:00,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:13:00,410 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:13:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:00,567 INFO L93 Difference]: Finished difference Result 137 states and 204 transitions. [2023-11-12 02:13:00,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:13:00,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:13:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:00,573 INFO L225 Difference]: With dead ends: 137 [2023-11-12 02:13:00,575 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 02:13:00,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:13:00,581 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 73 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:00,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 205 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:13:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 02:13:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2023-11-12 02:13:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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:13:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2023-11-12 02:13:00,617 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 114 [2023-11-12 02:13:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:00,622 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2023-11-12 02:13:00,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:13:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2023-11-12 02:13:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:13:00,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:00,632 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:00,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:13:00,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:00,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 237839506, now seen corresponding path program 1 times [2023-11-12 02:13:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:00,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766091382] [2023-11-12 02:13:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:13:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:13:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:13:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:13:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:13:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:13:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:13:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:13:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:13:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:13:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:13:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:13:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:13:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:13:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:13:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:13:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,404 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:13:04,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:04,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766091382] [2023-11-12 02:13:04,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766091382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:04,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:13:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968381776] [2023-11-12 02:13:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:04,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:13:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:13:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:13:04,415 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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:13:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:05,454 INFO L93 Difference]: Finished difference Result 177 states and 256 transitions. [2023-11-12 02:13:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:13:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 115 [2023-11-12 02:13:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:05,458 INFO L225 Difference]: With dead ends: 177 [2023-11-12 02:13:05,458 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 02:13:05,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2023-11-12 02:13:05,461 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:05,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 628 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:13:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 02:13:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 65. [2023-11-12 02:13:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:13:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2023-11-12 02:13:05,478 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 115 [2023-11-12 02:13:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:05,479 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2023-11-12 02:13:05,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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:13:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2023-11-12 02:13:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:13:05,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:05,482 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:05,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:13:05,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:05,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1117785961, now seen corresponding path program 1 times [2023-11-12 02:13:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716424514] [2023-11-12 02:13:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:13:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:13:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:13:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:13:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:13:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:13:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:13:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:13:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:13:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:13:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:13:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:13:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:13:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:13:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:13:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:13:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,648 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:13:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:05,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716424514] [2023-11-12 02:13:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716424514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:05,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:13:05,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358244934] [2023-11-12 02:13:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:05,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:13:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:05,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:13:05,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:13:05,653 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:13:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:05,682 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2023-11-12 02:13:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:13:05,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 116 [2023-11-12 02:13:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:05,688 INFO L225 Difference]: With dead ends: 136 [2023-11-12 02:13:05,689 INFO L226 Difference]: Without dead ends: 74 [2023-11-12 02:13:05,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:13:05,701 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:05,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:13:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-12 02:13:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2023-11-12 02:13:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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:13:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-11-12 02:13:05,723 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 116 [2023-11-12 02:13:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:05,724 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-11-12 02:13:05,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:13:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-11-12 02:13:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:13:05,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:05,727 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:05,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:13:05,727 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:05,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1175044263, now seen corresponding path program 1 times [2023-11-12 02:13:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:05,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572901870] [2023-11-12 02:13:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:13:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:13:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:13:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:13:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:13:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:13:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:13:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:13:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:13:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:13:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:13:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:13:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:13:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:13:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:13:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:13:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,026 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:13:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:08,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572901870] [2023-11-12 02:13:08,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572901870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:08,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:08,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:13:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156011828] [2023-11-12 02:13:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:08,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:13:08,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:13:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:13:08,031 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:13:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:08,680 INFO L93 Difference]: Finished difference Result 206 states and 276 transitions. [2023-11-12 02:13:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 02:13:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 116 [2023-11-12 02:13:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:08,683 INFO L225 Difference]: With dead ends: 206 [2023-11-12 02:13:08,683 INFO L226 Difference]: Without dead ends: 144 [2023-11-12 02:13:08,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:13:08,684 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 65 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:08,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 673 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:13:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-12 02:13:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 70. [2023-11-12 02:13:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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:13:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2023-11-12 02:13:08,708 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 116 [2023-11-12 02:13:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:08,710 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2023-11-12 02:13:08,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:13:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2023-11-12 02:13:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:13:08,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:08,712 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:08,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:13:08,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:08,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash -473979685, now seen corresponding path program 1 times [2023-11-12 02:13:08,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:08,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316422902] [2023-11-12 02:13:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:13:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:13:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:13:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:13:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:13:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:13:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:13:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:13:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:13:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:13:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:13:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:13:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:13:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:13:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:13:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:13:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:12,843 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:13:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:12,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316422902] [2023-11-12 02:13:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316422902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:12,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:13:12,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699744066] [2023-11-12 02:13:12,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:12,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:13:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:12,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:13:12,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:13:12,848 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:13:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:14,160 INFO L93 Difference]: Finished difference Result 152 states and 197 transitions. [2023-11-12 02:13:14,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-12 02:13:14,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 116 [2023-11-12 02:13:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:14,163 INFO L225 Difference]: With dead ends: 152 [2023-11-12 02:13:14,163 INFO L226 Difference]: Without dead ends: 150 [2023-11-12 02:13:14,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2023-11-12 02:13:14,164 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 80 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:14,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 517 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:13:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-12 02:13:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 70. [2023-11-12 02:13:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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:13:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2023-11-12 02:13:14,176 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 116 [2023-11-12 02:13:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:14,177 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2023-11-12 02:13:14,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:13:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2023-11-12 02:13:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:13:14,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:14,179 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:13:14,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:14,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 331312688, now seen corresponding path program 1 times [2023-11-12 02:13:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284481897] [2023-11-12 02:13:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:14,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:13:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:14,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:13:14,330 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:13:14,331 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:13:14,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:13:14,337 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:14,341 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:13:14,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:13:14 BoogieIcfgContainer [2023-11-12 02:13:14,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:13:14,426 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:13:14,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:13:14,426 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:13:14,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:58" (3/4) ... [2023-11-12 02:13:14,429 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:13:14,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:13:14,431 INFO L158 Benchmark]: Toolchain (without parser) took 16563.95ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 101.4MB in the beginning and 101.4MB in the end (delta: 32.5kB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2023-11-12 02:13:14,431 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 148.9MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:13:14,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.81ms. Allocated memory is still 148.9MB. Free memory was 101.2MB in the beginning and 88.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:13:14,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.36ms. Allocated memory is still 148.9MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:13:14,432 INFO L158 Benchmark]: Boogie Preprocessor took 38.13ms. Allocated memory is still 148.9MB. Free memory was 85.8MB in the beginning and 84.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:13:14,432 INFO L158 Benchmark]: RCFGBuilder took 608.02ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 84.2MB in the beginning and 148.9MB in the end (delta: -64.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2023-11-12 02:13:14,433 INFO L158 Benchmark]: TraceAbstraction took 15479.05ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 147.9MB in the beginning and 101.4MB in the end (delta: 46.5MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2023-11-12 02:13:14,433 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 262.1MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:13:14,435 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.29ms. Allocated memory is still 148.9MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.81ms. Allocated memory is still 148.9MB. Free memory was 101.2MB in the beginning and 88.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.36ms. Allocated memory is still 148.9MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.13ms. Allocated memory is still 148.9MB. Free memory was 85.8MB in the beginning and 84.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 608.02ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 84.2MB in the beginning and 148.9MB in the end (delta: -64.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15479.05ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 147.9MB in the beginning and 101.4MB in the end (delta: 46.5MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 262.1MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 5; [L23] unsigned char var_1_6 = 1; [L24] signed long int var_1_7 = 0; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] signed long int var_1_12 = 15; [L29] signed long int var_1_13 = 1; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] signed long int var_1_16 = 16; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] signed long int last_1_var_1_12 = 15; VAL [isInitial=0, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=100] [L77] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=100] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L80] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L80] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L83] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L83] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L84] var_1_13 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L86] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L86] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L88] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L93] var_1_16 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L95] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L95] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L96] var_1_18 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L97] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L98] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L98] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=25, var_1_9=253] [L112] RET updateVariables() [L113] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L48] COND TRUE var_1_19 > var_1_9 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=15, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L49] COND TRUE \read(var_1_6) [L50] var_1_12 = (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=508, var_1_10=254, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=508, var_1_10=254, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=5, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=508, var_1_10=254, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=10, var_1_18=126, var_1_19=254, var_1_1=2147483647, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L69] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=508, var_1_10=254, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=2147483647, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((signed long int) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((signed long int) (var_1_13 - var_1_16))) : (var_1_12 == ((signed long int) var_1_16)))) : (var_1_12 == ((signed long int) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=-1, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=2147483647, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=-1, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=2147483647, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=15, var_1_10=254, var_1_12=-1, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=6, var_1_17=126, var_1_18=126, var_1_19=254, var_1_1=2147483647, var_1_6=1, var_1_7=2147483647, var_1_8=254, var_1_9=253] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 2244 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1582 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 791 IncrementalHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 662 mSDtfsCounter, 791 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 61, 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, 262 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 685 ConstructedInterpolants, 0 QuantifiedInterpolants, 3090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:13:14,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:13:17,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:13:17,356 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-12 02:13:17,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:13:17,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:13:17,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:13:17,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:13:17,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:13:17,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:13:17,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:13:17,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:13:17,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:13:17,419 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:13:17,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:13:17,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:13:17,422 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:13:17,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:13:17,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:13:17,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:13:17,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:13:17,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:13:17,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:13:17,427 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:13:17,427 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:13:17,428 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:13:17,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:13:17,429 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:13:17,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:13:17,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:13:17,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:13:17,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:13:17,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:13:17,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:13:17,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:13:17,433 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:13:17,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:13:17,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:13:17,434 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:13:17,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:13:17,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:13:17,436 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:13:17,437 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:13:17,437 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_d1cd8ef0-062f-49db-922b-5e39b5e220af/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_d1cd8ef0-062f-49db-922b-5e39b5e220af/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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2023-11-12 02:13:17,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:13:17,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:13:17,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:13:17,954 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:13:17,954 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:13:17,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-12 02:13:21,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:13:21,718 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:13:21,719 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-12 02:13:21,728 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data/5e3537e68/2cae76bc1db0473cabf91b4a86d074e6/FLAG8a8883557 [2023-11-12 02:13:21,742 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/data/5e3537e68/2cae76bc1db0473cabf91b4a86d074e6 [2023-11-12 02:13:21,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:13:21,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:13:21,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:13:21,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:13:21,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:13:21,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:21" (1/1) ... [2023-11-12 02:13:21,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be843ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:21, skipping insertion in model container [2023-11-12 02:13:21,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:21" (1/1) ... [2023-11-12 02:13:21,784 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:13:21,961 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_d1cd8ef0-062f-49db-922b-5e39b5e220af/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-12 02:13:22,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:13:22,072 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:13:22,090 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_d1cd8ef0-062f-49db-922b-5e39b5e220af/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-12 02:13:22,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:13:22,153 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:13:22,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22 WrapperNode [2023-11-12 02:13:22,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:13:22,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:13:22,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:13:22,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:13:22,177 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:13:22" (1/1) ... [2023-11-12 02:13:22,202 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:13:22" (1/1) ... [2023-11-12 02:13:22,255 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2023-11-12 02:13:22,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:13:22,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:13:22,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:13:22,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:13:22,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:13:22,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:13:22,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:13:22,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:13:22,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (1/1) ... [2023-11-12 02:13:22,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:13:22,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:22,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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:13:22,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/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:13:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:13:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:13:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:13:22,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:13:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:13:22,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:13:22,566 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:13:22,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:13:24,035 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:13:24,042 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:13:24,042 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:13:24,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:24 BoogieIcfgContainer [2023-11-12 02:13:24,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:13:24,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:13:24,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:13:24,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:13:24,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:13:21" (1/3) ... [2023-11-12 02:13:24,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797f03a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:13:24, skipping insertion in model container [2023-11-12 02:13:24,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:22" (2/3) ... [2023-11-12 02:13:24,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797f03a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:13:24, skipping insertion in model container [2023-11-12 02:13:24,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:24" (3/3) ... [2023-11-12 02:13:24,058 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-12 02:13:24,076 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:13:24,076 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:13:24,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:13:24,140 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;@1e31b09b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:13:24,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:13:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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:13:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-12 02:13:24,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:24,161 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:13:24,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:24,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash 912981449, now seen corresponding path program 1 times [2023-11-12 02:13:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:13:24,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637315958] [2023-11-12 02:13:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:24,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:13:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:13:24,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:13:24,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-12 02:13:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:24,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:13:24,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:13:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-12 02:13:24,515 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:13:24,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:13:24,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637315958] [2023-11-12 02:13:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637315958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:13:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670254857] [2023-11-12 02:13:24,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:24,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:13:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:13:24,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:13:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:13:24,560 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:13:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:24,592 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2023-11-12 02:13:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:13:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2023-11-12 02:13:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:24,602 INFO L225 Difference]: With dead ends: 105 [2023-11-12 02:13:24,602 INFO L226 Difference]: Without dead ends: 52 [2023-11-12 02:13:24,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:13:24,610 INFO L413 NwaCegarLoop]: 76 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, 76 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:13:24,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:13:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-12 02:13:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-12 02:13:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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:13:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2023-11-12 02:13:24,659 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 114 [2023-11-12 02:13:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:24,660 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2023-11-12 02:13:24,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:13:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2023-11-12 02:13:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-12 02:13:24,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:24,664 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:13:24,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:24,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:13:24,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:24,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1975372663, now seen corresponding path program 1 times [2023-11-12 02:13:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:13:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457600562] [2023-11-12 02:13:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:13:24,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:13:24,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:13:24,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-12 02:13:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:25,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:13:25,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:13:25,240 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:13:25,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:13:25,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:13:25,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457600562] [2023-11-12 02:13:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457600562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:25,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:25,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:13:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941235845] [2023-11-12 02:13:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:25,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:13:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:13:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:13:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:13:25,253 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:13:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:26,295 INFO L93 Difference]: Finished difference Result 137 states and 204 transitions. [2023-11-12 02:13:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:13:26,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:13:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:26,299 INFO L225 Difference]: With dead ends: 137 [2023-11-12 02:13:26,299 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 02:13:26,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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:13:26,302 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:26,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 255 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 02:13:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 02:13:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2023-11-12 02:13:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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:13:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2023-11-12 02:13:26,319 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 114 [2023-11-12 02:13:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:26,321 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2023-11-12 02:13:26,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:13:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2023-11-12 02:13:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:13:26,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:26,324 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:13:26,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:26,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:13:26,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:13:26,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash 237839506, now seen corresponding path program 1 times [2023-11-12 02:13:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:13:26,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291607996] [2023-11-12 02:13:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:26,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:13:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:13:26,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:13:26,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-12 02:13:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:26,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:13:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:26,918 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2023-11-12 02:13:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [211678502] [2023-11-12 02:13:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-12 02:13:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/cvc4 [2023-11-12 02:13:26,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-12 02:13:26,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cd8ef0-062f-49db-922b-5e39b5e220af/bin/uautomizer-verify-uTZkv6EMXl/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-12 02:13:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:27,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 02:13:27,212 INFO L285 TraceCheckSpWp]: Computing forward predicates...